The equidistribution of some vincular patterns on 132-avoiding permutations

نویسنده

  • Vincent Vajnovszki
چکیده

A pattern in a permutation π is a sub-permutation of π, and this paper deals mainly with length three patterns. In 2012 Bóna showed the rather surprising fact that the cumulative number of occurrences of the patterns 231 and 213 are the same on the set of permutations avoiding 132, even though the pattern based statistics 231 and 213 do not have the same distribution on this set. Here we show that if it is required for the symbols playing the role of 1 and 3 in the occurrences of 231 and 213 to be adjacent, then the obtained statistics are equidistributed on the set of 132-avoiding permutations. Actually, expressed in terms of vincular patterns, we prove bijectively the following more general results: the statistics based on the patterns 231, 213 and 213, together with other statistics, have the same joint distribution on Sn(132) of length n permutations avoiding 132, and so do the patterns 231 and 312; and up to trivial transformations, these statistics are the only based on lengththree proper (not classical nor consecutive) vincular patterns which are equidistributed on a set of permutations avoiding a classical length-three pattern.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The equidistribution of some length three vincular patterns on $S_n(132)$

In 2012 Bóna showed the rather surprising fact that the cumulative number of occurrences of the classical patterns 231 and 213 are the same on the set of permutations avoiding 132, beside the pattern based statistics 231 and 213 do not have the same distribution on this set. Here we show that if it is required for the symbols playing the role of 1 and 3 in the occurrences of 231 and 213 to be a...

متن کامل

Some Wilf-equivalences for Vincular Patterns

We prove several Wilf-equivalences for vincular patterns of length 4, some of which generalize to infinite families of vincular patterns. We also present functional equations for the generating functions for the number of permutations of length n avoiding σ for the patterns 124-3, 134-2, 231-4, 241-3, 132-4, and 142-3. This nearly completes the Wilfclassification of vincular patterns of length ...

متن کامل

J un 2 01 7 Enumerations of Permutations Simultaneously Avoiding a Vincular and a Covincular Pattern of Length

Vincular and covincular patterns are generalizations of classical patterns allowing restrictions on the indices and values of the occurrences in a permutation. In this paper we study the integer sequences arising as the enumerations of permutations simultaneously avoiding a vincular and a covincular pattern, both of length 3, with at most one restriction. We see familiar sequences, such as the ...

متن کامل

Enumerations of Permutations Simultaneously Avoiding a Vincular and a Covincular Pattern of Length 3

Vincular and covincular patterns are generalizations of classical patterns allowing restrictions on the indices and values of the occurrences in a permutation. In this paper we study the integer sequences arising as the enumerations of permutations simultaneously avoiding a vincular and a covincular pattern, both of length 3, with at most one restriction. We see familiar sequences, such as the ...

متن کامل

Refining Enumeration Schemes to Count According to Permutation Statistics

We develop algorithmic tools to compute quickly the distribution of permutation statistics over sets of pattern-avoiding permutations. More specfically, the algorithms are based on enumeration schemes, the permutation statistics are based on the number of occurrences of certain vincular patterns, and the permutations avoid sets of vincular patterns. We prove that whenever a finite enumeration s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017